QR-like Algorithms for Eigenvalue Problems
نویسنده
چکیده
In the year 2000 the dominant method for solving matrix eigen-value problems is still the QR algorithm. This paper discusses the family of GR algorithms, with emphasis on the QR algorithm. Included are historical remarks, an outline of what GR algorithms are and why they work, and descriptions of the latest, highly parallelizable, versions of the QR algorithm. Now that we know how to parallelize it, the QR algorithm seems likely to retain its dominance for many years to come.
منابع مشابه
Survey of power , QR , and oepomo ’ s iterative methods for solution of largest eigenvalue of essentially positive matrices
Survey of power, QR, and oepomo's iterative methods for solution of largest eigenvalue of essentially positive matrices. Abstract. Many of the popular methods for the solution of largest eigenvalue of essentially positive ir-reducible matrices are surveyed with the hope of finding an efficient method suitable for electromagnetic engineering, radiation problems, system identification problems, a...
متن کاملFast and Stable Unitary Qr Algorithm
A fast Fortran implementation of a variant of Gragg’s unitary Hessenberg QR algorithm is presented. It is proved, moreover, that all QRand QZ-like algorithms for the unitary eigenvalue problems are equivalent. The algorithm is backward stable. Numerical experiments are presented that confirm the backward stability and compare the speed and accuracy of this algorithm with other methods.
متن کاملFast QR factorization of Cauchy-like matrices
n this paper we present two fast numerical methods for computing the QR factorization of a Cauchy-like matrix C with data points lying on the real axis or on the unit circle in the complex plane. It is shown that the rows of the Q-factor of C give the eigenvectors of a rank structured matrix partially determined by some prescribed spectral data. This property establishes a basic connection betw...
متن کاملAlgebraic Eigenvalue Problems
Even if both A and B are real-valued, it is likely that λ and x are complexvalued. Finding the solution of eigensystems is a fairly complicated procedure. It is at least as difficult as finding the roots of polynomials. Therefore, any numerical method for solving eigenvalue problems is expected to be iterative in nature. Algorithms for solving eigenvalue problems include the power method, subsp...
متن کاملCondition Number Bounds for Problems with Integer Coefficients
An explicit a priori bound for the condition number associated to each of the following problems is given: general linear equation solving, least squares, non-symmetric eigenvalue problems, solving univariate polynomials, and solving systems of multivariate polynomials. It is assumed that the input has integer coefficients and is not on the degeneracy locus of the respective problem (i.e., the ...
متن کامل